A Marriage Problem Using Threshold Algorithm

)–Approximation Algorithm for the Stable Marriage Problem

We propose an approximation algorithm for the problem of finding a maximum stable matching when both ties and unacceptable partners are allowed in preference lists. Our algorithm achieves the approximation ratio 2− c logN N for an arbitrarily positive constant c, where N denotes the number of men in an input. This improves the trivial approximation ratio of two.

An Extended Stable Marriage Problem Algorithm for Clone Detection

Code cloning negatively affects industrial software and threatens intellectual property. This paper presents a novel approach to detecting cloned software by using a bijective matching technique. The proposed approach focuses on increasing the range of similarity measures and thus enhancing the precision of the detection. This is achieved by extending a well-known stable-marriage problem (SMP) ...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

The Stable Marriage Problem

Group Marriage Problem

Let G be a permutation group acting on [n] = {1, . . . , n} and V = {Vi : i = 1, . . . , n} be a system of n subsets of [n]. When is there an element g ∈ G so that g(i) ∈ Vi for each i ∈ [n]? If such g exists, we say that G has a G-marriage subject to V . An obvious necessary condition is the orbit condition: for any ∅ 6= Y ⊆ [n], ⋃ y∈Y Vy ⊇ Y g = {g(y) : y ∈ Y } for some g ∈ G. Keevash (J. Com...